Lecture 18: Deligne-simpson Problem
نویسنده
چکیده
The Deligne-Simpson problem asks to find a condition on conjugacy classes C1, . . . , Ck ⊂ Matn(C) such that there are matrices Yi ∈ Ci with (1) ∑k i=1 Yi = 0, (2) and there are no proper subspaces in C stable under all Yi. Crawley-Boevey reduced this problem to checking if there is an irreducible representation in Rep(Π(Q), v) for suitable Q, λ, v produced from C1, . . . , Ck. Recall, Section 4.1 of Lecture 17, that this is equivalent to v ∈ Σλ, where Σλ ⊂ Z0 is a combinatorially defined set. Crawley-Boevey’s approach was strongly motivated the Kraft-Procesi construction who proved that the closures of conjugacy classes of matrices are normal. The proof easily reduces to the case of nilpotent orbits. Kraft and Procesi realized their closures as certain quotients that are special cases of Nakajima quiver varieties. This allowed them to prove the normality. In the first section we will recall the necessary background from Invariant theory, a field that studies quotients under group actions. Then we will explain the Kraft-Procesi construction. Finally, we will explain Crawley-Boevey’s approach to the DS problem.
منابع مشابه
ar X iv : m at h / 04 04 18 6 v 1 [ m at h . R A ] 8 A pr 2 00 4 MULTIPLICATIVE PREPROJECTIVE ALGEBRAS , MIDDLE CONVOLUTION AND THE DELIGNE - SIMPSON PROBLEM
We introduce a family of algebras which are multiplicative analogues of preprojective algebras, and their deformations, as introduced by M. P. Holland and the first author. We show that these algebras provide a natural setting for the ‘middle convolution’ operation introduced by N. M. Katz in his book ‘Rigid local systems’, and put in an algebraic setting by M. Dettweiler and S. Reiter, and by ...
متن کاملOn the Deligne-Simpson problem and its weak version
We consider the Deligne-Simpson problem (DSP) (resp. the weak DSP): Give necessary and sufficient conditions upon the choice of the p + 1 conjugacy classes cj ⊂ gl(n,C) or Cj ⊂ GL(n,C) so that there exist irreducible (p+ 1)-tuples (resp. (p+ 1)-tuples with trivial centralizers) of matrices Aj ∈ cj with zero sum or of matrices Mj ∈ Cj whose product is I. The matrices Aj (resp. Mj) are interprete...
متن کاملThe Deligne-Simpson problem – a survey
The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes Cj ⊂ GL(n,C) or cj ⊂ gl(n,C) so that there exist irreducible (resp. with trivial centralizer) (p + 1)-tuples of matrices Mj ∈ Cj or Aj ∈ cj satisfying the equality M1 . . .Mp+1 = I or A1+ . . .+Ap+1 = 0. The matrices Mj and Aj are inter...
متن کامل0 Some examples related to the Deligne - Simpson problem ∗
In the present paper we consider some examples relative to the Deligne-Simpson problem (DSP) which is formulated like this: Give necessary and sufficient conditions upon the choice of the p+ 1 conjugacy classes cj ⊂ gl(n,C), resp. Cj ⊂ GL(n,C), so that there exist irreducible (p+1)-tuples of matrices Aj ∈ cj , A1 + . . .+Ap+1 = 0, resp. of matrices Mj ∈ Cj , M1 . . .Mp+1 = I. By definition, the...
متن کاملOn the Deligne-Simpson problem
The Deligne-Simpson problem is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes Cj ⊂ SL(n,C) or cj ⊂ sl(n,C) so that there exist irreducible (p + 1)-tuples of matrices Mj ∈ Cj or Aj ∈ cj satisfying the equality M1 . . .Mp+1 = I or A1 + . . .+Ap+1 = 0. We solve the problem for generic eigenvalues with the exception of the case of matrices Mj ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015